Layered circle packings
نویسندگان
چکیده
Given a bounded sequence of integers {d0,d1,d2, . . .}, 6 ≤ dn ≤M, there is an associated abstract triangulation created by building up layers of vertices so that vertices on the nth layer have degree dn. This triangulation can be realized via a circle packing which fills either the Euclidean or the hyperbolic plane. We give necessary and sufficient conditions to determine the type of the packing given the defining sequence {dn}.
منابع مشابه
0 Conformally symmetric circle packings . A generalization of Doyle spirals
Circle packings (and more generally patterns) as discrete analogs of conformal mappings is a fast developing field of research on the border of analysis and geometry. Recent progress was initiated by Thurston’s idea [T] about the approximation of the Riemann mapping by circle packings. The corresponding convergence was proven by Rodin and Sullivan [RS]; many additional connections with analytic...
متن کاملRandom Walks of Circle Packings
A notion of random walks for circle packings is introduced. The geometry behind this notion is discussed, together with some applications. In particular, we obtain a short proof of a result regarding the type problem for circle packings, which shows that the type of a circle packing is closely related to the type of its tangency graph.
متن کامل1 6 A ug 1 99 5 RANDOM WALKS OF CIRCLE PACKINGS
A notion of random walks for circle packings is introduced. The geometry behind this notion is discussed, together with some applications. In particular, we obtain a short proof of a result regarding the type problem for circle packings, which shows that the type of a circle packing is closely related to the type of its tangency graph.
متن کاملApollonian Circle Packings of the Half-plane
We consider Apollonian circle packings of a half Euclidean plane. We give necessary and sufficient conditions for two such packings to be related by a Euclidean similarity (that is, by translations, reflections, rotations and dilations) and describe explicitly the group of self-similarities of a given packing. We observe that packings with a non-trivial self-similarity correspond to positive re...
متن کاملOptimal Substructures in Optimal and Approximate Circle Packings
This paper deals with the densest packing of equal circles in a square problem. Sharp bounds for the density of optimal circle packings have given. Several known optimal and approximate circle packings contain optimal substructures. Based on this observation it is sometimes easy to determine the minimal polynomials of the arrangements.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005